Application of Method Threshold Secret Sharing in Securing Data

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Threshold Secret Image Sharing

A (k, n) threshold secret image sharing scheme, abbreviated as (k, n)-TSISS, splits a secret image into n shadow images in such a way that any k shadow images can be used to reconstruct the secret image exactly. In 2002, for (k, n)-TSISS, Thien and Lin reduced the size of each shadow image to 1 k of the original secret image. Their main technique is by adopting all coefficients of a (k − 1)-deg...

متن کامل

Securing Barcodes Using Compressed Secret Sharing Scheme

Bar code provides convenient way for people labeling a tag on a product so that people can easily and quickly identify the content of product itself. Large information of any product can be store in the form of bar codes which reduces the size of data. When this bar code contains important data or privacy information, the risk of security becomes an important problem. This paper proposes a secr...

متن کامل

Multi-Threshold Visual Secret Sharing

Visual cryptography (VC) has been developed extensively based on its practicability. These schemes can encode a black-and-white secret image into several shadow images, and, by stacking a certain number of shadow images, can retrieve the secret image through the human visual system. In this paper, we employ Hsu et al.’s ideal multi-threshold secret sharing scheme based on monotone span programs...

متن کامل

On Hierarchical Threshold Secret Sharing

Recently, two novel schemes have been proposed for hierarchical threshold secret sharing, one based on Birkoff interpolation and another based on bivariate Lagrange interpolation. In this short paper, we propose a much simpler solution for this problem.

متن کامل

Repairable Threshold Secret Sharing Schemes

In this paper, we propose a class of new threshold secret sharing schemes with repairing function between shares. Specifically, each share, when it is broken or lost, can be repaired by some others without the help of the dealer. Further, a construction of such repairable threshold secret sharing schemes is designed by applying linearized polynomials and regenerating codes in distributed storag...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Physics: Conference Series

سال: 2019

ISSN: 1742-6588,1742-6596

DOI: 10.1088/1742-6596/1361/1/012021